Search results for "Project Scheduling"
showing 5 items of 5 documents
Justification technique generalizations
2006
The justification technique was introduced various decades ago for the resource-constrained project scheduling problem, although it has rarely been used with the problem. Justification is a simple and quick technique which when applied to schedules produces a new schedule that is, at most, as long as the original schedule — and often shorter. A recent article (Valls et al, 2005), showed that incorporating justification in heuristic algorithms can produce a substancial improvement in the results obtained. These results have motivated us to generalise this technique in order to study it in greater depth. This paper proposes distinct forms and generalisations for the justification technique an…
Project Scheduling Methods Based on Theory of Ordered Fuzzy Numbers
2020
In this the paper we present new methods, called OFCPM, OFPERT, for estimating a project completion time in the situation when activity duration times in the project are given in the form of Ordered Fuzzy Numbers OFNs. Extended Critical Path Method and Project Evaluation and Review Technique have been developed as new methods dedicated to project scheduling, preserving its basic concept. Ordered fuzzy numbers are used to project scheduling under uncertainty. The duration time of each project activity is estimated by experts (experts views of the activity duration time) based on their experience. These new methods will be verify on some examples. The comparison of our fuzzy approaches to exi…
Un procedimiento de fuerte reducción de las dimensiones del RCPS/π
2009
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit into classical models, but can be found in real problems in timetabling and labour scheduling. When modelling real problems, the problem of project scheduling with partially renewable resources, as many other combinatorial problems, gets such large dimensions that it is quite difficult to apply solution procedures. In this paper, we describe some powerful preprocessi…
A hybrid genetic algorithm for the resource-constrained project scheduling problem
2008
Abstract In this paper we propose a Hybrid Genetic Algorithm (HGA) for the Resource-Constrained Project Scheduling Problem (RCPSP). HGA introduces several changes in the GA paradigm: a crossover operator specific for the RCPSP; a local improvement operator that is applied to all generated schedules; a new way to select the parents to be combined; and a two-phase strategy by which the second phase re-starts the evolution from a neighbour’s population of the best schedule found in the first phase. The computational results show that HGA is a fast and high quality algorithm that outperforms all state-of-the-art algorithms for the RCPSP known by the authors of this paper for the instance sets j…
A Population-Based Approach to the Resource-Constrained Project Scheduling Problem
2004
We present a population-based approach to the RCPSP. The procedure has two phases. The first phase handles the initial construction of a population of schedules and these are then evolved until high quality solutions are obtained. The evolution of the population is driven by the alternative application of an efficient improving procedure for locally improving the use of resources, and a mechanism for combining schedules that blends scatter search and path relinking characteristics. The objective of the second phase is to explore in depth those vicinities near the high quality schedules. Computational experiments on the standard j120 set, generated using ProGen, show that our algorithm produ…